Uncertain systems are universal approximators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncertain Systems are Universal Approximators

Uncertain inference is a process of deriving consequences from uncertain knowledge or evidences via the tool of conditional uncertain set. Based on uncertain inference, uncertain system is a function from its inputs to outputs. This paper proves that uncertain systems are universal approximators, which means that uncertain systems are capable of approximating any continuous function on a compac...

متن کامل

Fuzzy systems with defuzzification are universal approximators

In this paper, we consider a fundamental theoretical question: Is it always possible to design a fuzzy system capable of approximating any real continuous function on a compact set with arbitrary accuracy? Moreover, we research whether the answer to the above question is positive when we restrict to a fixed (but arbitrary) type of fuzzy reasoning and to a subclass of fuzzy relations. This resul...

متن کامل

Monotone Boolean Functions Are Universal Approximators

The employment of proper codings, such as the base-2 coding, has allowed to establish the universal approximation property of Boolean functions: if a sufficient number b of inputs (bits) is taken, they are able to approximate arbitrarily well any real Borel measurable mapping. However, if the reduced set of monotone Boolean functions, whose expression involves only and and or operators, is cons...

متن کامل

Deep Belief Networks Are Compact Universal Approximators

Deep Belief Networks (DBN) are generative models with many layers of hidden causal variables, recently introduced by Hinton et al. (2006), along with a greedy layer-wise unsupervised learning algorithm. Building on Le Roux and Bengio (2008) and Sutskever and Hinton (2008), we show that deep but narrow generative networks do not require more parameters than shallow ones to achieve universal appr...

متن کامل

Deep Narrow Boltzmann Machines are Universal Approximators

We show that deep narrow Boltzmann machines are universal approximators of probability distributions on the activities of their visible units, provided they have sufficiently many hidden layers, each containing the same number of units as the visible layer. Besides from this existence statement, we provide upper and lower bounds on the sufficient number of layers and parameters. These bounds sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Uncertainty Analysis and Applications

سال: 2014

ISSN: 2195-5468

DOI: 10.1186/2195-5468-2-13